gang scheduling造句

• Gang scheduling is based on a data structure called the Ousterhout matrix.
• Gang scheduling is a stricter variant of coscheduling that disallows fragments completely.
• A specific algorithm is known as gang scheduling.
• Gang scheduling is stricter than coscheduling.
• Gang scheduling is used so that if two or more threads or processes communicate with each other, they will all be ready to communicate at the same time.
• When processors are over-subscribed and gang scheduling is not used within a group of processes or threads which communicate with each other, it can lead to situations where each communication event suffers the overhead of a context switch.